Pseudo-Random Bit Generation (PRBG) is required in many aspects ofcryptography as well as in other applications of modern security engineering.In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type isconsidered. The sequences generated with a chaotic PRBG of this type, arestatistically tested and the computational effectiveness of the generators isestimated. Considering this PRBG valid for cryptography, the size of theavailable key space is also calculated. Different cryptographic applicationscan be suitable to this PRBG, being a stream cipher probably the most immediateof them.
展开▼